A Mathematical Programming Approach to Community Structure Detection in Complex Networks
نویسندگان
چکیده
The detection of community structure is a widely recognised method of revealing the underlying properties of complex networks in biological, physical and social sciences. The simplest form of the community structure problem is the partitioning of unweighted and undirected networks into disjoint communities. However, module detection in weighted networks or communities with overlapping modules may lead to more realistic applications. Optimisation of the modularity metric is a popular method for community structure detection (Newman and Girvan 2004) and here we extend its use to propose mixed integer nonlinear programming (MINLP) models for (i) partitioning of weighted networks and (ii) detection of overlapping communities. The mathematical programming nature of the methods proposed provide users with an adaptability that may not be available in alternative modelling frameworks. Overall, we show that our methods improve existing methodologies in terms of applicability and adaptability and offer a versatile solution to the community detection problem.
منابع مشابه
A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملCommunity Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملتشخیص اجتماعات ترکیبی در شبکههای اجتماعی
One of the great challenges in Social Network Analysis (SNA) is community detection. Community is a group of vertices which have high intra connections and sparse inter connections. Community detection or Clustering reveals community structure of social networks and hidden relationships among their constituents. By considering the increase of datasets related to social networks, we need scalabl...
متن کاملAn Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks
The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کامل